EPiC Series in Computing
نویسندگان
چکیده
Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that support the emission of clausal proofs. In the second phase, we propose to use a powerful off-the-shelf generalpurpose compression tool, such as bzip2 and 7z. Sorting literals before compression facilitates a delta encoding, which combined with variable-byte encoding improves the quality of the compression. We show that clausal proofs can be compressed by one order of magnitude by applying both phases.
منابع مشابه
Understanding EPIC Architectures and Implementations
HP and Intel have recently introduced a new style of instruction set architecture called EPIC (Explicitly Parallel Instruction Computing), and a specific architecture called the IPF (Itanium Processor Family). This paper seeks to illustrate the differences between EPIC architectures and former styles of instruction set architectures such as superscalar and VLIW. Several aspects of EPIC architec...
متن کاملThe Implementation and Evaluation of a Low-Power Clock Distribution Network Based on EPIC
The multiply clock domain (MCD) technique is a novel technique to compromising between synchronous systems and asynchronous systems to reduce the power. However, most present studies of MCD are based on superscalar architectures. In this paper, MCDE, a MCD technique based on explicitly parallel instruction computing (EPIC) architecture is designed and implemented to reduce the power of clock di...
متن کاملEPiC Series in Computing
We describe our initial experiments with several state-of-the-art automated theorem provers on the problems in Tarskian Geometry created by Beeson and Wos. In comparison to the manually-guided OTTER proofs by Beeson and Wos, we can solve a large number of problems fully automatically, in particular thanks to the recent large-theory reasoning methods.
متن کاملEPiC Series in Computing
We present a method we call structure-based preferential bumping, a low-cost way to exploit formula structure in VSIDS-based SAT solvers. We show that the SAT solver Glucose, when modified with preferential bumping of certain easily identified structurally important variables, out-performs unmodified Glucose on the industrial formulas from recent SAT solver competitions.
متن کاملCloud Computing; A New Approach to Learning and Learning
Introduction: The cloud computing and services, as a technological solution for developing educational services, can accelerate the provision and expansion of these highly useful services. This study intended to provide an overall picture of practical areas of learning services based on cloud computing teaching and learning equipment. Methods: This was a theoretical hybrid research study in whi...
متن کاملA Comparative Analysis Between EPIC Static Instruction Scheduling and DTSVLIW Dynamic Instruction Scheduling
To achieve performance, Explicitly Parallel Instruction Computing (EPIC) systems take the responsibility of extracting instruction-level parallelism (ILP) from the hardware and give it to the compiler. They expose a large part of the hardware control at the conventional machine level. Dynamically Trace Scheduled VLIW (DTSVLIW) systems, on the other hand, leave the responsibility of extracting...
متن کامل